A complete symbolic bisimulation for full applied pi calculus

A Complete Symbolic Bisimulation for Full Applied Pi Calculus

Symbolic Bisimulation for the Applied Pi Calculus

We propose a symbolic semantics for the finite applied pi calculus.The applied pi calculus is a variant of the pi calculus with extensions formodelling cryptographic protocols. By treating inputs symbolically, oursemantics avoids potentially infinite branching of execution trees due toinputs from the environment. Correctness is maintained by associatingwith each process a se...

Symbolic bisimulation for the applied pi calculus ( extended abstract ) ⋆

Recently, we have proposed in [10] a symbolic semantics together with a sound symbolic labelled bisimulation relation for the finite applied pi calculus. By treating inputs symbolically, our semantics avoids potentially infinite branching of execution trees due to inputs from the environment. This work is an important step towards automation of observational equivalence for the finite applied p...

Symbolic Bisimulation for the Applied Pi Calculus * Stéphanie Delaune

We propose a symbolic semantics for the finite applied pi calculus.The applied pi calculus is a variant of the pi calculus with extensions formodelling cryptographic protocols. By treating inputs symbolically, oursemantics avoids potentially infinite branching of execution trees due toinputs from the environment. Correctness is maintained by associatingwith each process a se...

Symbolic Bisimulation for Full LOTOS

A symbolic semantics for Full LOTOS in terms of symbolic transition systems is deened, following the approach taken for message passing CCS in HL95a], altered to take account of the particular features of LOTOS (multi-way synchronisation, value negotiation, selection predicates). Symbolic bisimulation over symbolic transition systems is deened, and symbolic bisimulation on ground behaviour expr...